Regularization Inertial Proximal Point Algorithm for Convex Feasibility Problems in Banach Spaces
نویسندگان
چکیده
Abstract The purpose of this paper is to give a regularization variant of the inertial proximal point algorithm not only in an infinite-dimensional Banach space E, which is an uniformly smooth and uniformly convex, but also in its finite-dimensional approximations for finding a point in the nonempty intersection ∩i=1Ci, where N ≥ 1 is an integer and each Ci is assumed to be the fixed point set of a nonexpansive mapping Ti : E → E, without the weak sequential continuous property for a normalized duality maping of E.
منابع مشابه
A Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملA proximal point method in nonreflexive Banach spaces
We propose an inexact version of the proximal point method and study its properties in nonreflexive Banach spaces which are duals of separable Banach spaces, both for the problem of minimizing convex functions and of finding zeroes of maximal monotone operators. By using surjectivity results for enlargements of maximal monotone operators, we prove existence of the iterates in both cases. Then w...
متن کاملOn Uniform Convexity, Total Convexity and Convergence of the Proximal Point and Outer Bregman Projection Algorithms in Banach Spaces
In this paper we study and compare the notions of uniform convexity of functions at a point and on bounded sets with the notions of total convexity at a point and sequential consistency of functions, respectively. We establish connections between these concepts of strict convexity in infinite dimensional settings and use the connections in order to obtain improved convergence results concerning...
متن کاملRegularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in Banach spaces
* Correspondence: [email protected] Department of Mathematics Education, Kyungnam University, Masan, Kyungnam, 631-701, Korea Full list of author information is available at the end of the article Abstract We study the strong convergence of a regularization proximal point algorithm for finding a common fixed point of a finite family of nonexpansive mappings in a uniformly convex and unifo...
متن کاملW-convergence of the proximal point algorithm in complete CAT(0) metric spaces
In this paper, we generalize the proximal point algorithm to complete CAT(0) spaces and show that the sequence generated by the proximal point algorithm $w$-converges to a zero of the maximal monotone operator. Also, we prove that if $f: Xrightarrow ]-infty, +infty]$ is a proper, convex and lower semicontinuous function on the complete CAT(0) space $X$, then the proximal...
متن کامل